- noncomputable function
- невычисляемая функция
English-Russian dictionary of mechanical engineering and automation. - RUSSO. B.S. Voskoboinikov, V.L. Mitrovich. 2003.
noncomputable function
Смотреть что такое "noncomputable function" в других словарях:
noncomputable — adjective (Of a function) Incapable of being computed by any deterministic algorithm in any finite amount of time. Syn: nonrecursive … Wiktionary
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Busy beaver — In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… … Wikipedia
Reduction (complexity) — Example of a reduction from a boolean satisfiability problem to a vertex cover problem. Blue vertices form a vertex cover which corresponds to truth values. In computability theory and computational complexity theory, a reduction is a… … Wikipedia
Busy beaver — Castor affairé Pour les articles homonymes, voir castor. Le castor affairé, dont le nom a été proposé par le mathématicien hongrois Tibor Radó, est l un des premiers exemples de fonction non calculable. Un castor affairé est une machine de Turing … Wikipédia en Français
Castor Affairé — Pour les articles homonymes, voir castor. Le castor affairé, dont le nom a été proposé par le mathématicien hongrois Tibor Radó, est l un des premiers exemples de fonction non calculable. Un castor affairé est une machine de Turing à n états qui… … Wikipédia en Français
Castor affaire — Castor affairé Pour les articles homonymes, voir castor. Le castor affairé, dont le nom a été proposé par le mathématicien hongrois Tibor Radó, est l un des premiers exemples de fonction non calculable. Un castor affairé est une machine de Turing … Wikipédia en Français
Castor affairé — Pour les articles homonymes, voir castor. En mathématiques, et plus précisément en théorie de la calculabilité, le castor affairé, dont le nom a été proposé par le mathématicien hongrois Tibor Radó, est l un des premiers exemples de fonction non… … Wikipédia en Français
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… … Wikipedia
